A weighted-sum method for solving the bi-objective traveling thief problem

Many real-world optimization problems have multiple interacting components. Each of these can be an NP-hard problem, and they in conflict with each other, i.e., the optimal solution for one component does not necessarily represent other This a challenge single-objective formulations, where respective influence that has on overall quality vary from instance to instance. In this paper, we study bi-objective formulation traveling thief which as components salesperson problem knapsack problem. We present weighted-sum method makes use randomized versions existing heuristics, outperforms participants 6 9 instances recent competitions, found new best solutions 379 instances.